A Novel Approach for Visibility Search Graph based Path Planning

نویسندگان

  • A. H. ALI
  • MUSA MAILAH
  • TANG HOWE HING
چکیده

In this paper, a novel search graph approach has been developed to find a free-collision path in a complicated unknown environment. This algorithm gives the possibility to consider some constraints based on the real world path as in road or factory environments. The main feature of the proposed approach is it’s capability to deal with unknown environments. To assess the capability of this algorithm to navigate through complex environment, it was implemented in a roundabout setting. A simulation study on the laser simulator based on the proposed algorithm for mobile robot system was performed using the MATLAB computational platform. In this simulation, a grid map of road roundabout environment was created and it was used in the selection of most optimum traveling path, based on the respective road traffic rules. The effectiveness of the developed navigation system was evaluated by including obstacles into the mobile robot’s working environment. From the results, it is confirmed that the performance of the proposed path planning algorithm is outstanding and mobile robot is able to track the best path from selected start to the goal point, especially when detecting obstacles. Key-Words: Path Planning, Free-Collision Search Path, Laser Simulator, Road Roundabout, Road Curbs, MATLAB.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective Path-aware Approach for Keyword Search over Data Graphs

Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...

متن کامل

A voronoi diagram-visibility graph-potential field compound algorithm for robot path planning

Numerous methods have been developed to solve the motion planning problem, among which the Voronoi diagram, visibility graph, and potential fields are well-known techniques. In this paper, a new path planning algorithm is presented where these three methods are integrated for the first time in a single architecture. After constructing the generalized Voronoi diagram of C-space, we introduce a n...

متن کامل

Path Planning in a Dynamic Environment

Path planning is an important area in the control of autonomous mobile robots. Recent work has focused on aspects reductions in processing time than the memory requirements. A dynamic environment uses a lot of memory and hence the processing time increases too. Our approach is to reduce the processing time by the use of a pictorial approach to reduce the number of data used. In this paper, we p...

متن کامل

Visibility Graph For Path Planning In The Presence Of Moving Obstacles

Path planning and navigation are two important areas in the control of autonomous mobile robots. In both cases, the resolution of the problem is to move the mobile robot while taking into account internal and external constraints. In this paper, we present an approach that operates in three steps. First, a construction of the visibility tree is performed. The following treatments are not perfor...

متن کامل

The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility

In the first part of this paper, we present the Optimal Searcher Path problem with Visibility, a novel path planning approach that models interregion visibility and that uses concepts from search theory to model uncertainty on the goal’s (i.e., the search object) detectability and location. In the second part, we introduce the Ant Search algorithm, a solving technique based on ant colony optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013